Representing Focus in LTAG
نویسنده
چکیده
The paper proposes an LTAG semantic analysis to derive semantic representations for different focus constructions in a uniform way. The proposal is shown via examples of different narrow focus constructions, multiple foci and focus in questions.
منابع مشابه
LTAG Semantics of Focus
This paper presents LTAG semantics of focus and focus-sensitive quantifiers which adopts alternative semantics of focus (Rooth 1985 and subsequent work). It proposes that focused lexical items make its contribution at the level of elementary trees, so that each elementary tree is associated with two semantic representations: its ordinary semantic representation and its focus representation. Bas...
متن کاملComputing Discourse Semantics: The Predicate-Argument Semantics of Discourse Connectives in D-LTAG
Abstract. D-LTAG is a discourse-level extension of Lexicalized Tree-Adjoining Grammar (LTAG), in which discourse syntax is projected by different types of discourse connectives and discourse interpretation is a product of compositional rules, anaphora resolution, and inference. In this paper, we present a D-LTAG extension of ongoing work on an LTAG syntaxsemantic interface. First, we show how p...
متن کاملLTAG-spinal and the Treebank a new resource for incremental, dependency and semantic parsing
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Unlike in traditional LTAG, subcategorization frames and the argument-adjunct distinction are left underspecified in LTAG-spinal. LTAG-spinal with adjunction constraints is weakly equivalent to LTAG. The LTAG-spinal for...
متن کاملStatistical Ltag Parsing
STATISTICAL LTAG PARSING Libin Shen Aravind K. Joshi In this work, we apply statistical learning algorithms to Lexicalized Tree Adjoining Grammar (LTAG) parsing, as an effort toward statistical analysis over deep structures. LTAG parsing is a well known hard problem. Statistical methods successfully applied to LTAG parsing could also be used in many other structure prediction problems in NLP. F...
متن کاملGrammar conversion from LTAG to HPSG
We propose an algorithm for the conversion of grammars from an arbitrary FB-LTAG grammar into a strongly equivalent HPSG-style grammar. Our algorithm converts LTAG elementary trees into HPSG feature structures by encoding the tree structures in stacks. A set of pre-determined rules manipulate the stack to emulate substitution and adjunction. We have used our algorithm to obtain HPSG-style gramm...
متن کامل